On the nonnegative signed domination numbers in graphs
نویسندگان
چکیده
A nonnegative signed dominating function (NNSDF) of a graph G is a function f from the vertex set V (G) to the set {−1, 1} such that ∑ u∈N [v] f(u) ≥ 0 for every vertex v ∈ V (G). The nonnegative signed domination number of G, denoted by γ s (G), is the minimum weight of a nonnegative signed dominating function on G. In this paper, we establish some sharp lower bounds on the nonnegative signed domination number of graphs in terms of their order, size and maximum and minimum degree.
منابع مشابه
Nonnegative signed total Roman domination in graphs
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EJGTA
دوره 4 شماره
صفحات -
تاریخ انتشار 2016